On reliability of the folded hypercubes q

نویسندگان

  • Qiang Zhu
  • Jun-Ming Xu
  • Xinmin Hou
  • Min Xu
چکیده

In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n 2 for n P 8; and k2(FQn) = 3n 1 for n P 5. That is, for n P 8 (resp. n P 5), at least 3n 2 vertices (resp. 3n 1 edges) of FQn are removed to get a disconnected graph that contains no isolated vertices (resp. edges). When the folded hypercube is used to model the topological structure of a large-scale parallel processing system, these results can provide more accurate measurements for reliability and fault tolerance of the system. 2006 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The g-Extra Conditional Diagnosability of Folded Hypercubes

Diagnosability plays a crucial role in measuring the reliability and fault tolerance of interconnection networks. The g-extra conditional diagnosability of multiprocessor systems is a new diagnosability, which is more accurate than the classical diagnosability. In this paper, we show that the g-extra conditional diagnosability t̃g(FQn) of the folded hypercube FQn is (g + 1)n − ( g 2 ) + 1 under ...

متن کامل

Characterizing which powers of hypercubes and folded hypercubes are divisor graphs

In this paper, we show that Q n is a divisor graph, for n = 2, 3. For n ≥ 4, we show that Q n is a divisor graph iff k ≥ n− 1. For folded-hypercube, we get FQn is a divisor graph when n is odd. But, if n ≥ 4 is even integer, then FQn is not a divisor graph. For n ≥ 5, we show that (FQn) k is not a divisor graph, where 2 ≤ k ≤ ⌈ 2 ⌉ − 1.

متن کامل

Embedding Variants of Hypercubes with Dilation

Graph embedding has been known as a powerful tool for implementation of parallel algorithms and simulation of interconnection networks. In this paper, we introduce a technique to obtain a lower bound for the dilation of an embedding. Moreover, we give algorithms for embedding variants of hypercubes with dilation 2 proving that the lower bound obtained is sharp. Further, we compute the exact wir...

متن کامل

Implementation of Four Common Functions on an LNS Co-Processor

[9] C.-T. Ho, “ Full bandwidth communications on folded hypercubes,” in Proc. Int. Con5 Parallel Processing, vol. I, Penn State, 1989, pp. 276280. [IO] -, “An observation on the bisectional interconnection networks,” IEEE Trans. Compui., vol. 41, no. 7, pp. 873-877, July 1992. [ I I ] S. Latifi and A. El-Amawy, “on folded hypercubes,” in Proc. Int. Con5 Parallel Processing, vol. 1, Penn State, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006